1370A - Maximum GCD - CodeForces Solution

greedy implementation math number theory *800

Please click on ads to support us..

Python Code: 

for i in range(int(input())):
    n = int(input())
    print(n//2)

C++ Code: 

#include <iostream>
#include <cstdio>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cassert>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <sstream>
#include <numeric>
#include <climits>

using namespace std;

int main(int argc, char **argv) {
    int T;
    scanf("%d", &T);
    while (T-- != 0) {
        int n;
        scanf("%d", &n);
        printf("%d\n", n >> 1);
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

1618C - Paint the Array
469A - I Wanna Be the Guy
1294A - Collecting Coins
1227A - Math Problem
349A - Cinema Line
47A - Triangular numbers
1516B - AGAGA XOOORRR
1515A - Phoenix and Gold
1515B - Phoenix and Puzzle
155A - I_love_username
49A - Sleuth
1541A - Pretty Permutations
1632C - Strange Test
673A - Bear and Game
276A - Lunch Rush
1205A - Almost Equal
1020B - Badge
1353A - Most Unstable Array
770A - New Password
1646B - Quality vs Quantity
80A - Panoramix's Prediction
1354B - Ternary String
122B - Lucky Substring
266B - Queue at the School
1490A - Dense Array
1650B - DIV + MOD
1549B - Gregor and the Pawn Game
553A - Kyoya and Colored Balls
1364A - XXXXX
1499B - Binary Removals